A Classification of Lattice-based Trapdoor Functions

نویسندگان

  • Rakyong Choi
  • Kwangjo Kim
چکیده

A trapdoor function is a one-way function with trapdoor, which is indispensable for getting a preimage of the function. In lattice-based cryptography, trapdoor function plays an important role in constructing the secure cryptographic schemes like identity-based encryption, homomorphic encryption, or homomorphic signature. There are three categories of trapdoor functions as standard trapdoor, lossy trapdoor, and homomorphic trapdoor functions. Lossy trapdoor function is a trapdoor function that behaves in two ways as a standard trapdoor function or by losing information from the input. Homomorphic trapdoor function can evaluate the computation of trapdoor function results. In this paper, we survey all the public literature on lattices studying lattice-based trapdoor functions and their preimage sampling algorithms to the best of our knowledge. Then, we classify these trapdoor functions into three categories depending on their cryptographic features and suggest their feasibility to design cryptographic primitives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of New Linearly Homomorphic Signatures on Lattice

This paper introduces two designs to enhance the Boneh and Freemans linearly homomorphic signature over binary fields, to overcome the limitations to implement homomorphic signatures to the real world scenario due to the heavy calculation and under multiple signers setting for a message. Based on our concurrent work on classification on lattice-based trapdoor functions in SCIS 2017, we modify s...

متن کامل

Short Signatures from Homomorphic Trapdoor Functions

We present a lattice-based stateless signature scheme provably secure in the standard model. Our scheme has a constant number of matrices in the public key and a single lattice vector (plus a tag) in the signatures. The best previous lattice-based encryption schemes were the scheme of Ducas and Micciancio (CRYPTO 2014), which required a logarithmic number of matrices in the public key and that ...

متن کامل

A Compact Signature Scheme with Ideal Lattice ( Extended

Since the seminal work of Ajtai [1], lattice-based cryptography has attracted many researchers. As fruitful results, there are one-way and collision-resistant hash functions (e.g., [1, 6]) and public-key cryptosystems, which are secure based on the worst-case hardness of lattice problems. However, the primitives have drawbacks; The size of a public key and that of an index of hash functions is ...

متن کامل

Compact Lossy and All-but-One Trapdoor Functions from Lattice

Lossy trapdoor functions (LTDF) and all-but-one trapdoor functions (ABO-TDF) are fundamental cryptographic primitives. And given the recent advances in quantum computing, it would be much desirable to develop new and improved lattice-based LTDF and ABO-TDF. In this work, we provide more compact constructions of LTDF and ABO-TDF based on the learning with errors (LWE) problem. In addition, our L...

متن کامل

An Efficient Identity-based Signature from Lattice in the Random Oracle Model

We propose an efficient identity-based signature (IBS) scheme. The security of our scheme is proved in the random oracle model. Core technical components of our constructions are built on an arborist extends its control for a lattice to an arbitrary higher-dimensional extension. We use lattice's growth and lattice basis randomization securely to generate the user's secret key, and use trapdoor ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016